GMPLS label space minimization through hypergraph layouts
نویسندگان
چکیده
منابع مشابه
GMPLS label space minimization through hypergraph layouts
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strateg...
متن کاملDesigning Hypergraph Layouts to GMPLS Routing Strategies
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing s...
متن کاملGMPLS Routing Strategies based on the Design of Hypergraph Layouts
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing s...
متن کاملOptical-Label Switching, MPLS, MPLambdaS and GMPLS
This paper discusses the new architecture and protocol of Optical-Label switching in light of its interworking with MPLS and MPLambdaS networks. The dynamic and agile characteristics of Optical-Label switching indicate its support of diverse QoS, CoS, and ToS services while interoperating packet and circuit switching. Optical-Label switching routers employ time, space, and wavelength domain swi...
متن کاملLabel Propagation for Hypergraph Partitioning
Many problems in computer science can be represented by a graph and reducedto a graph clustering or k-way partitioning problem. In the classical definition,a graph consists of nodes and edges which usually connect exactly two nodes.Hypergraphs are a generalization of graphs, where every edge can connect anarbitrary number of nodes. Recent results suggest that some problems i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.033